A Study and Implementation of RSA Cryptosystem

This project involves an implementation of the Rivest Shamir Adleman (RSA)[1] encryption algorithm in C. It consists of generation of two random prime numbers and a number coprime to φ(n) also called euler toitent function. These three are used to generate a public key and private key. The user has to enter a message which is encrypted by the public key. The algorithm also decrypts the generated cipher text with the help of the private key and returns the plain text message which was encrypted earlier. General Terms Plain Text: The general message needed to be encrypted is called plain text. Cipher Text: The Garbage like looking string having no information about plain text is called cipher text.